Improving Scheduling Criteria of Preemptive Tasks Scheduled under Round Robin Algorithm using Changeable Time Quantum
نویسندگان
چکیده
منابع مشابه
Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum
Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling criteria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quantum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important bene...
متن کاملModified Round Robin Scheduling Algorithm Using Variable Time Slice
CPU scheduling is the basis of multi-programmed operating systems. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. Round Robin assumes that all processes are equally important; each receives an equal portion (time slice) of the CPU. This will sometimes affect the performance of CPU. This paper considers...
متن کاملEstimation of Quantum Time Length for Round-robin Scheduling Algorithm using Neural Networks
The quantum time length is usually taken as a fixed value in all applications that use Round Robin (RR) scheduling algorithm. The determination of the optimal length of the quantum that results in a small average turn around time is very complicated because of the unknown nature of the tasks in the ready queue. The round robin algorithm becomes very similar to the first in first served algorith...
متن کاملFinding Time Quantum of round Robin Cpu Scheduling Algorithm in General Computing Systems Using Integer Programming
In Round Robin Scheduling, the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads res...
متن کاملAn Optimum Time Quantum Using Linguistic Synthesis for Round Robin Scheduling Algorithm
In Round Robin CPU scheduling algorithm the main concern is with the size of time quantum and the increased waiting and turnaround time. Decision for these is usually based on parameters which are assumed to be precise. However, in many cases the values of these parameters are vague and imprecise. The performance of fuzzy logic depends upon the ability to deal with Linguistic variables. With th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science & Systems Biology
سال: 2011
ISSN: 0974-7230
DOI: 10.4172/jcsb.1000078